a=int(input())
b=[int(i) for i in input().split()]
c=[]
d=a-1
for i in range(a):
if b.count(b[d])==1:
c=c+[b[d]]
if b.count(b[d])!=1 and c.count(b[d])==0:
c=c+[b[d]]
d=d-1
c=c[::-1]
print(len(c))
print(*c)
#include <bits/stdc++.h>
using namespace std;
int was[1005];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int a[n+3];
vector <int> v;
for(int i=1;i<=n;i++){
cin >> a[i];
}
for(int i=n;i>=1;i--){
if(was[a[i]]==0){
v.push_back(a[i]);
was[a[i]]++;
}
}
reverse(v.begin(),v.end());
cout << v.size() << "\n";
for(int i=0;i<v.size();i++){
cout << v[i] << " ";
}
return 0;
}672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |